13. Appendices

Sequential Bayesian Search Appendices

Assume that at the beginning of game t, the system's belief in the user's preference is P t. Then, the certainty-equivalet user preference during game t is π * t (i) = E π∼Pt [π(i)] ∀i ∈ I. Recall we define π * min = min i∈I π * (i), Lemma A-1 formalizes the result that if π * t is " close " to π * , then for any decision tree T , E i∼π * t [N (T, i)] is " close " to E i∼π * [N (T, i)]: Lemma A...

File S1: Appendices

We wish to reduce the number of parameters in the model and make it so that the model is more easily comparable to our previous work [1]. To do this we first look at the nonspatial single morph model which is given by: Ni(t+ 1) = (1 + b)Ni(t) exp(−mi −mi (1 + b)Nt) For the purpose of this model we want the carrying capacity K to be fixed by the equilibrium population density. We therefore calcu...

Appendices : Not for Publication

Our primary source for climate data is the Terrestrial Air Temperature and Precipitation: 19002006 Gridded Monthly Time Series, Version 1.01 (2007), compiled by Kenji Matsuura and Cort Willmott in conjunction with NASA. The data are available at http://climate.geog.udel.edu/ ~climate/html_pages/download.html. This dataset combines station data on mean air temperature and precipitation from a nu...

Online Appendices, Not for Publication

In this section, we provide basic definitions and interpretations for the different network characteristics that we consider. At the household level, we study: • Degree: the number of links that a household has. This is a measure of how well connected a node is in the graph. • Clustering coefficient: the fraction of a household’s neighbors that are themselves neighbors. This is a measure of how...

Online Appendices for “Full Substitutability”